TRAVELLING SALESMAN PROBLEM (TSP) OPTIMIZATION SEED DIS-TRIBUTION USING GENETIC ALGORITHM

نویسندگان

چکیده

Abstract: Distribution is an important the business sector, agricultural sector for distributing seeds to ensure location of customers selling seeds. Problems that are often encountered seed distribution process efficiency time and distance distribution. Re search will build software entering initial data several dynamically added consumer agents. The parameter uses latitude-longitude integrated on google maps detects varying store locations, generation chromosomes or best path with minimum route. heuristic approach using Genetic Algorithm imitates concept biological evolution random exchange structure series. This study distribute 3 types a choice weights have been divided into areas located map Indonesia land routes. results test population average fitness value tend remain from previous 1-10 optimum iteration 9-12 44.2. Optimal obtained when Mr higher than Cr values. Thus, can be used TSP paths. 1:2 evaluation compared usual estimates . Keywords: Algorithm; Route Optimization; Seed Distribution; Abstrak: Distribusi menjadi hal penting berwirausaha, salah satunya pada bidang pertanian untuk pendistribusian benih sampai lokasi tujuan. Permasalahan sering ditemui dalam proses adalah efektifan, efisiensi waktu dan jarak tempuh. Sehingga penelitian akan membangun perangkat lunak dengan memasukan titik awal beberapa tujuan agen konsumen ditambahkan secara dinamis. Parameter menggunakan terintegrasi yang mendeteksi keberadaan lokasi, selanjutnya diketahui generasi kromosom atau jalur distribusi terbaik rute minimum. Pendekatan Heuristic Algoritma Genetika meniru konsep evolusi biologis deretan struktur pertukaran informasi acak. Tujuan ini dapat mendistribusikan jenis pilihan bobot telah terbagi wilayah lokasi. Satu terdapat toko dinamis, sudah ditentukan keberangkatan. Penelitian menekankan penentuan saja. Hasil pengujian jumlah populasi rata-rata nilai cenderung bersifat tetap dari sebelumnya selisih iterasi 44,2. didapatkan ketika Mutation rate (Mr) lebih tinggi dibanding Crossover (Cr). Maka, bisa digunakan menghasilkan evaluasi fitnes dibandingkan estimasi biasa digunakan.Kata kunci: Genetika; Benih; Optimalisasi Rute;

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Moving Target Travelling Salesman Problem using Genetic Algorithm

In this paper, the Moving Target Travelling Salesman Problem (MTTSP) is described. In MTTSP, several sites are required to be visited which are moving with constant velocity in different directions. The distance of the sites from origin, velocity and the angle of movement are known in advance. The goal is to find the fastest tour starting and ending at the origin which intercepts all the sites....

متن کامل

Solving Travelling Salesman Problem using Clustering Genetic Algorithm

Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is obser...

متن کامل

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

Limited amount of time and computational resources in industrial domain makes Ant Colony Optimization (ACO) a useful approach to find near optimal solutions in polynomial time for Nondeterministic Polynomial time (NP) problems. For dynamically changing graphs, such as in case of network routing and urban transportation systems which are based on Travelling Salesman Problem (TSP), the ant colony...

متن کامل

Classical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager’s Ranking

Bellman RE, Zadeh LA . 1970. Decision-making in a fuzzy environment, Manage. Sci. , 17: 141-164. Hannan EL 1981. Linear programming with multiple fuzzy goals. Fuzzy Sets Syst. , 6: 235-248 Hansen MP 2000. Use of substitute Scalarizing Functions to guide Local Search based Heuristics: The case of MOTSP, J. Heuristics, 6: 419-431 Jaszkiewicz A 2002. Genetic Local Search for Multiple Objectives Co...

متن کامل

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JURTEKSI (Jurnal Teknologi dan Sistem Informasi)

سال: 2022

ISSN: ['2550-0201', '2407-1811']

DOI: https://doi.org/10.33330/jurteksi.v8i3.1738